On Computational Sentence Generation From Logical Form

نویسنده

  • Juen-tin Wang
چکیده

This paper describes some computational and linguistical mechanisms in our program written in SIMULA to generate natural language sentences from their underlying logical structures in an extended predicate logic. After the presentation of the augumented logical formalism to deal with illocutionary acts,we explain then the basic devices used in the generation process:semiotic interpretation,orders of quantifications or derivational constraints,the referential property of variables and the Leibniz-Frege idea. Examples from system output will be given.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Computational Theory of Context Dependence

This paper describes a reversible system for the interpretation and generation of sentences containing context dependent constructs like pronouns, focus, and ellipsis. A variant of`quasi-logical form' is used as an underspeci-ed meaning representation, related tòresolved logical forms' viàconditional equivalences'. These equivalences deene the semantics of contextually dependent constructs with...

متن کامل

Ambiguous Noun Phrases in Logical Form

In this paper, logical form representations for pronouns, singular definite noun phrases (NPs), and singular indefinite NPs are developed. These representations allow decisions about the precise meaning of a sentence to be postponed until the required information becomes available. Three computational constraints for this logical form are proposed: compactness, modularity, and formal consistenc...

متن کامل

A Complete, Efficient Sentence-Realization Algorithm for Unification Grammar

This paper describes an efficient sentence-realization algorithm that is complete for a very general class of unification grammars. Under fairly modest constraints on the grammar, the algorithm is shown to be polynomial time for generation of sentences whose logical form exactly matches the goal logical form. The algorithm can be extended to handle what is arguably the most important subcase of...

متن کامل

Amalgam: A machine-learned generation module

Amalgam is a novel system for sentence realization during natural language generation. Amalgam takes as input a logical form graph, which it transforms through a series of modules involving machine-learned and knowledge-engineered sub-modules into a syntactic representation from which an output sentence is read. Amalgam constrains the search for a fluent sentence realization by following a ling...

متن کامل

Interpreting Negatives in Discourse

In recent work, tableau-based model generation calculi have been used as computational models of the reasoning processes involved in utterance interpretation. In this linguistic application of an inference technique that was originally developed for automated theorem proving, natural language understanding is treated as a process of generating Herbrand models for the logical form of an utteranc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1980